Counting the Changes of Random D02 Sets
نویسندگان
چکیده
Consider a Martin-Löf random ∆2 set Z. We give lower bounds for the number of changes of Zs n for computable approximations of Z. We show that each nonempty Π 1 class has a low member Z with a computable approximation that changes only o(2) times. We prove that each superlow ML-random set already satisfies a stronger randomness notion called balanced randomness, which implies that for each computable approximation and each constant c, there are infinitely many n such that Zs n changes more than c2 times.
منابع مشابه
Not so different after all: a comparison of methods for detecting amino acid sites under selection.
We consider three approaches for estimating the rates of nonsynonymous and synonymous changes at each site in a sequence alignment in order to identify sites under positive or negative selection: (1) a suite of fast likelihood-based "counting methods" that employ either a single most likely ancestral reconstruction, weighting across all possible ancestral reconstructions, or sampling from ances...
متن کاملCounting the Changes of Random ∆2 Sets
Consider a Martin-Löf random ∆2 set Z. We give lower bounds for the number of changes of Zs n for computable approximations of Z. We show that each nonempty Π 1 class has a low member Z with a computable approximation that changes only o(2) times. We prove that each superlow ML-random set already satisfies a stronger randomness notion called balanced randomness, which implies that for each comp...
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملA Dimensional Result for Random Self-similar Sets
A very important property of a deterministic self-similar set is that its Hausdorff dimension and upper box-counting dimension coincide. This paper considers the random case. We show that for a random self-similar set, its Hausdorff dimension and upper box-counting dimension are equal a.s.
متن کاملOptimization of measurement counting time in Gamma-ray spectrometry of soil samples
The method of optimal measurement counting time in Gamma spectrometry for soil samples was studied. Gamma spectrometry was done based on minimum detectable activity using the HPGe- p type with efficiency of 30% and FWHM 1.7keV (for 1.33 MeV 60Co). The samples were IAEA-RG Th-1, IAEA-RGU-1 and IAEA-RGK-1 prepared in bottles. The measurements were done for 12 different counting times from 5 min t...
متن کامل